An exploration strategy for non-stationary opponents
نویسندگان
چکیده
منابع مشابه
An Exploration Strategy Facing Non-Stationary Agents
The success or failure of any learning algorithm is partially due to the exploration strategy it exerts. However, most exploration strategies assume that the environment is stationary and non-strategic. This work investigates how to design exploration strategies in non-stationary and adversarial environments. Our experimental setting uses a two agents strategic interaction scenario, where the o...
متن کاملModeling non-stationary opponents
This paper studies repeated interactions between an agent and an unknown opponent that changes its strategy over time. We propose a framework for learning switching nonstationary strategies. The approach uses decision trees to learn the most up to date opponent’s strategy. Then, the agent’s strategy is computed by transforming the tree into a Markov Decision Process (MDP), whose solution dictat...
متن کاملDetecting Switches Against Non-Stationary Opponents
Interactions in multiagent systems are generally more complicated than single agent ones. Game theory provides solutions on how to act in multiple agent scenarios; however, it assumes that all agents will act rationally. Moreover, some works also assume the opponent will use a stationary strategy. These assumptions usually do not hold in real world scenarios where agents have limited capacities...
متن کاملLearning Against Non-Stationary Opponents in Double Auctions
Energy markets are emerging around the world. In this context, the PowerTAC competition has gained attention for being a realistic and powerful simulation platform that can be used to perform robust research on retail energy markets. Agent in this complex environment typically use different strategies throughout their interaction, changing from one to another depending on diverse factors, for e...
متن کاملIdentifying and Tracking Switching, Non-Stationary Opponents: A Bayesian Approach
In many situations, agents are required to use a set of strategies (behaviors) and switch among them during the course of an interaction. This work focuses on the problem of recognizing the strategy used by an agent within a small number of interactions. We propose using a Bayesian framework to address this problem. Bayesian policy reuse (BPR) has been empirically shown to be efficient at corre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Agents and Multi-Agent Systems
سال: 2016
ISSN: 1387-2532,1573-7454
DOI: 10.1007/s10458-016-9347-3